Oblivious Queries over Data with Irregular Structure

نویسنده

Yaron Kanza

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ارائه روشی پویا جهت پاسخ به پرس‌وجوهای پیوسته تجمّعی اقتضایی

Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...

متن کامل

Oblivious Query Processing

Motivated by cloud security concerns, there is an increasing interest in database systems that can store and support queries over encrypted data. A common architecture for such systems is to use a trusted component such as a cryptographic co-processor for query processing that is used to securely decrypt data and perform computations in plaintext. The trusted component has limited memory, so mo...

متن کامل

Persistent Cache-oblivious Streaming Indexes

In [SPAA2007], Bender et al. define a streaming B-tree (or index) as one that supports updates in amortized o(1) IOs, and present a structure achieving amortized O((logN)/B) IOs and queries in O(logN) IOs. We extend their result to the partially-persistent case. For a version v, let Nv be the number of keys accessible at v and N be the total number of updates. We give a data structure using spa...

متن کامل

Cache-Oblivious Persistence

Partial persistence is a general transformation that takes a data structure and allows queries to be executed on any past state of the structure. The cache-oblivious model is the leading model of a modern multi-level memory hierarchy. We present the first general transformation for making cache-oblivious model data structures partially persistent.

متن کامل